<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Hard
  </div>
  <div>
   <h1 class="question_title">
    154. Find Minimum in Rotated Sorted Array II
   </h1>
   <p>
    Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
   </p>
   <p>
    (i.e., &nbsp;
    <code>
     [0,1,2,4,5,6,7]
    </code>
    &nbsp;might become &nbsp;
    <code>
     [4,5,6,7,0,1,2]
    </code>
    ).
   </p>
   <p>
    Find the minimum element.
   </p>
   <p>
    The array may contain duplicates.
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [1,3,5]
<strong>Output:</strong> 1</pre>
   <p>
    <strong>
     Example 2:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> [2,2,2,0,1]
<strong>Output:</strong> 0</pre>
   <p>
    <strong>
     Note:
    </strong>
   </p>
   <ul>
    <li>
     This is a follow up problem to&nbsp;
     <a href="https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/">
      Find Minimum in Rotated Sorted Array
     </a>
     .
    </li>
    <li>
     Would allow duplicates affect the run-time complexity? How and why?
    </li>
   </ul>
  </div>
  <div>
   <h1 class="question_title">
    154. 寻找旋转排序数组中的最小值 II
   </h1>
   <p>
    假设按照升序排序的数组在预先未知的某个点上进行了旋转。
   </p>
   <p>
    ( 例如，数组&nbsp;
    <code>
     [0,1,2,4,5,6,7]
    </code>
    <strong>
    </strong>
    可能变为&nbsp;
    <code>
     [4,5,6,7,0,1,2]
    </code>
    &nbsp;)。
   </p>
   <p>
    请找出其中最小的元素。
   </p>
   <p>
    注意数组中可能存在重复的元素。
   </p>
   <p>
    <strong>
     示例 1：
    </strong>
   </p>
   <pre><strong>输入:</strong> [1,3,5]
<strong>输出:</strong> 1</pre>
   <p>
    <strong>
     示例&nbsp;2：
    </strong>
   </p>
   <pre><strong>输入:</strong> [2,2,2,0,1]
<strong>输出:</strong> 0</pre>
   <p>
    <strong>
     说明：
    </strong>
   </p>
   <ul>
    <li>
     这道题是&nbsp;
     <a href="https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/description/">
      寻找旋转排序数组中的最小值
     </a>
     &nbsp;的延伸题目。
    </li>
    <li>
     允许重复会影响算法的时间复杂度吗？会如何影响，为什么？
    </li>
   </ul>
  </div>
 </body>
</html>